Flexible Reuse of Plans by Abstraction and Reenement
نویسندگان
چکیده
Solution I. set_fixation(left) II. process_ready(right) III. set_fixation(right) IV. process_rough(left) V. process_fine(left) VI. set_fixation(none) Abstraction 1. 2.-6. 7.-8. 9.-12. 13.-14. 15. Initial state Goal State Solution Solution 1. chuck(left) 2. use_tool(right,t2) 3. cut(7,3) 4. unchuck 5. chuck(right), 6. use_tool(left,t1), 7.-11. cut(1,3),...,cut(5,3), 12. use_tool(center, t3) 13. cut(2,2) 14. cut(4,2) 15. unchuck Refinement 1. 2.-3. 4.-5. 6.-11. 11.-14. 15. II. III. IV. V. VI. I. II. III. IV. V. VI. I. Case C 1
منابع مشابه
Paris: Flexible Plan Adaptation by Abstraction and Reenement
Abstraction and Re nement Ralph Bergmann and Wolfgang Wilke Centre for Learning Systems and Applications (LSA) University of Kaiserslautern Dept. of Computer Science P.O.-Box 3049, D-67653 Kaiserslautern, Germany e-mail: [email protected] 1 Introducion Paris (Plan Abstraction and Re nement in an Integrated System) [4, 2] is a domain independent case-based planning system which allow...
متن کاملDecision-theoretic Reenement Planning: Principles and Application
We present a general theory of action abstraction for reducing the complexity of decision-theoretic planning. We develop projection rules for abstract actions and prove our abstraction techniques to be correct. We present a planning algorithm that uses the abstraction theory to eeciently explore the space of possible plans by eliminating suboptimal classes of plans without explicitly examining ...
متن کاملPlan Merging & Plan Reuse as Satisfiability
Planning as satissability has hitherto focused only on purely generative planning. There is an evidence in traditional reenement planning that planning incrementally by reusing or merging plans can be more eecient than planning from scratch (sometimes reuse is not eecient, but becomes necessary if the cost of abandoning the reusable plan is too high, when users are charged for the planning solu...
متن کاملPolymorphic Reuse Mechanisms for Object-Oriented Database Specifications
A polymorphic approach to the incremental design and reuse of object-oriented methods and query speciications is presented. Using this approach, the eeort required for manually reprogramming methods and queries due to schema modiications can be avoided or minimized. The salient features of our approach are the use of propagation patterns and a mechanism for propagation pattern reenement. Propag...
متن کاملStratiied Case-based Reasoning in Non-reenable Abstraction Hierarchies 1 Stratiied Case-based Reasoning { Adaptation. an Abstraction of a Stored Case May Be Much Easier to Reuse
Stratiied case-based reasoning (Scbr) is a technique in which case abstractions are used to assist case retrieval, matching, and adaptation. Previous work showed that Scbr can signiicantly decrease the computational expense required for retrieval, matching, and adaptation in a route-nding domain characterized by abstraction hierarchies with the downward reenement property. This work explores th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007